PackLib 2 : An integrated library of multi - dimensional packing problems q
نویسندگان
چکیده
We present PackLib, the first fully integrated benchmark library for multi-dimensional packing instances. PackLib combines a systematic collection of all benchmark instances from previous literature with a well-organized set of new and challenging large instances. The XML format allows linking basic benchmark data with other important properties, like bibliographic information, origin, best known solutions, runtimes, etc. Transforming instances into a variety of existing input formats is also quite easy, as the XML format lends itself to easy conversion; for this purpose, a number of parsers are provided. Thus, PackLib aims at becoming a one-stop location for the packing and cutting community: in addition to fair and easy comparison of algorithmic work and ongoing measurement of scientific progress, it poses numerous challenges for future research. 2006 Elsevier B.V. All rights reserved.
منابع مشابه
PackLib: An Integrated Library of Multi-Dimensional Packing Problems
We present PackLib, the first fully integrated benchmark library for multi-dimensional packing instances. PackLib combines a systematic collection of all benchmark instances from previous literature with a well-organized set of new and challenging large instances. The XML format allows linking basic benchmark data with other important properties, like bibliographic information, origin, best kno...
متن کاملPackLib2: An integrated library of multi-dimensional packing problems
We present PackLib, the first fully integrated benchmark library for multi-dimensional packing instances. PackLib combines a systematic collection of all benchmark instances from previous literature with a well-organized set of new and challenging large instances. The XML format allows linking basic benchmark data with other important properties, like bibliographic information, origin, best kno...
متن کاملOn Multi-dimensional Packing Problems
line and oo-line approximation algorithms for vector covering problems. analysis of algorithms for dual bin packing problems. packing can be solved within 1 + in linear time.gorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses.schatz. Resource scheduling in enhanced pay-per-view continuous media databases. An eecient approximation scheme for the one-dimensi...
متن کاملAn Interval Graph-based Tabu Search Framework for Multi-dimensional Packing
Packing is a vast and continuously growing field in the area of Operations Research and Combinatorial Optimization. Roughly speaking, given a set of items and a set of containers, packing problems are concerned with the loading of the items into the containers, according to some packing rules and optimizing a performance measure. Under this broad definition, we find a wide set of real-life and ...
متن کاملAn Online Q-learning Based Multi-Agent LFC for a Multi-Area Multi-Source Power System Including Distributed Energy Resources
This paper presents an online two-stage Q-learning based multi-agent (MA) controller for load frequency control (LFC) in an interconnected multi-area multi-source power system integrated with distributed energy resources (DERs). The proposed control strategy consists of two stages. The first stage is employed a PID controller which its parameters are designed using sine cosine optimization (SCO...
متن کامل